Power propagation time and lower bounds for power domination
نویسندگان
چکیده
5 We present a counterexample to a lower bound for power domination number given in Liao, Power 6 domination with bounded time constraints, J. Comb. Optim., in press 2014. We also define the power 7 propagation time and make connections between the power domination propagation ideas in Liao and the 8 (zero forcing) propagation time in Hogben et al, Propagation time for zero forcing on a graph, Discrete 9 Appl. Math., 2012. 10
منابع مشابه
Power propagation time and lower bounds for power domination number
We present a counterexample to a lower bound for power domination number given in Liao, Power domination with bounded time constraints, J. Comb. Optim., in press 2014. We also define the power propagation time and make connections between the power domination propagation ideas in Liao and the (zero forcing) propagation time in Hogben et al, Propagation time for zero forcing on a graph, Discrete...
متن کاملNote on power propagation time and lower bounds for the power domination number
We present a counterexample to a lower bound for the power domination number given in Liao, Power domination with bounded time constraints, J. Comb. Optim. 31 (2016): 725–742. We also define the power propagation time, using the power domination propagation ideas in Liao and the (zero forcing) propagation time in Hogben et al, Propagation time for zero forcing on a graph, Discrete Appl. Math., ...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملGeneralized power domination: propagation radius and Sierpiński graphs
The recently introduced concept of k-power domination generalizes domination and power domination, the latter concept being used for monitoring an electric power system. The k-power domination problem is to determine a minimum size vertex subset S of a graph G such that after setting X = N [S], and iteratively adding to X vertices x that have a neighbour v in X such that at most k neighbours of...
متن کاملHeredity for generalized power domination
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for γP,k(G − e), γP,k(G/e) and for γP,k(G − v) in terms of γP,k(G), and give examples for which these bounds are tight. We characterize all graphs for which γP,k(G− e) = γP,k(G) + 1 for any edge e...
متن کامل